On ill-conditioning in 3D Similarity Transformation
نویسندگان
چکیده
منابع مشابه
On 3D Shape Similarity
We study the 3D shape similarity between closed surfaces. We represent a curved or polyhedral 3D object of genus zero using a mesh representation that has nearly uniform distribution with known connectivity among mesh nodes. We define a shape similarity metric based on the L2 distance between the local curvature distributions over the mesh representations of the two objects. For both convex and...
متن کاملSolving the Ill - Conditioning in Neural
In this paper we investigate the feed-forward learning problem. The well-known ill-conditioning which is present in most feed-forward learning problems is shown to be the result of the structure of the network. Also, the well-known problem that weights between`higher' layers in the network have to settle beforèlower' weights can converge is addressed. We present a solution to these problems by ...
متن کاملIll-Conditioning in Neural Network Training Problems
The training problem for feedforward neural networks is nonlinear parameter estimation that can be solved by a variety of optimization techniques. Much of the literature on neural networks has focused on variants of gradient descent. The training of neural networks using such techniques is known to be a slow process with more sophisticated techniques not always performing signiicantly better. I...
متن کاملDeliberate Ill-conditioning of Krylov Matrices Deliberate Ill-conditioning of Krylov Matrices
This paper starts oo with studying simple extrapolation methods for the classical iteration schemes such as Richardson, Jacobi and Gauss-Seidel iteration. The extrapolation procedures can be interpreted as approximate minimal residual methods in a Krylov subspace. It seems therefore logical to consider, conversely, classical methods as pre-processors for Krylov subspace methods, as was done by ...
متن کاملOn the ill-conditioning of subspace identification with inputs
There is experimental evidence that the performance of standard subspace algorithms from the literature (e.g. the N4SID method) may be surprisingly poor in certain experimental conditions. This happens typically when the past signals (past inputs and outputs) and future input spaces are nearly parallel. In this paper we argue that the poor behavior may be attributed to a form of ill-conditionin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Environment and Geoinformatics
سال: 2015
ISSN: 2148-9173
DOI: 10.30897/ijegeo.302761